Smoothed Analysis of Three Combinatorial Problems
نویسندگان
چکیده
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x, the smoothed complexity is the average complexity of an instance obtained from x by a perturbation. The smoothed complexity of a problem is the worst smoothed complexity of any instance. Spielman and Teng introduced this notion for continuous problems. We apply the concept to combinatorial problems and study the smoothed complexity of three classical discrete problems: quicksort, left-to-right maxima counting, and shortest paths.
منابع مشابه
CSC 2411 - Linear Programming and Combinatorial Optimization ∗ Lecture 5 : Smoothed Analysis , Randomized Combinatorial Algorithms , and Linear Programming Duality
In this class, we discuss a few " post-simplex-algorithm " issues. We will first study the smoothed case analysis of Linear Programming problems. We then learn the Seidel's algorithm, a randomized com-binatorial algorithm that run in subexponential time, and its extensions. Last, we will be introduced to the duality theorem of Linear Programs. 1 Overview In the previous lecture, we learned the ...
متن کاملA MODIFIED COMPRESSIBLE SMOOTHED PARTICLE HYDRODYNAMICS (MCSPH) METHOD AND ITS APPLICATION ON THE NUMERICAL SIMULATION OF LOW AND HIGH VELOCITY IMPACTS
In this study a Modified Compressible Smoothed Particle Hydrodynamics (MCSPH) method is introduced which is applicable in problems involve shock wave structures and elastic-plastic deformations of solids. As a matter of fact, algorithm of the method is based on an approach which descritizes the momentum equation into three parts and solves each part separately and calculates their effects on th...
متن کاملDaniel A. Spielman Research Overview
My research over the past decade has focused on problems at the intersection of Algorithms and Combinatorics with Optimization, Scientific Computation and Engineering. In my work, I develop mathematically rigorous analyses of algorithms and heuristics used to solve fundamental computational problems. I then try to use these analyses to obtain insight into how these problems can be better solved...
متن کاملSmoothed Analysis of Algorithms and the Fujishige-Wolfe Algorithm to Minimize Submodular Functions
We study the method of smoothed analysis for understanding the complexity of algorithms. We first discuss the need for defining an alternative to worst case complexity and discuss some alternatives considered in analysis of algorithms. We then discuss smoothed analysis, introduced by Spielman and Teng [22] and describe how one could do a smoothed analysis of an algorithm. There are a few design...
متن کاملSmoothed Analysis of Selected Optimization Problems and Algorithms
Optimization problems arise in almost every field of economics, engineering, and science. Many of these problems are well-understood in theory and sophisticated algorithms exist to solve them efficiently in practice. Unfortunately, in many cases the theoretically most efficient algorithms perform poorly in practice. On the other hand, some algorithms are much faster than theory predicts. This d...
متن کامل